Real Analysis Chapter 5 Solutions Jonathan
نویسنده
چکیده
4. Note that ‖Tx− Tnxn‖ ≤ ‖Tx− Txn‖+ ‖Txn − Tnxn‖ ≤ ‖T‖‖x− xn‖+ ‖T − Tn‖‖xn‖, and the limit as n→∞ of the right hand side is 0, so limn→∞ Tnxn = Tx. 6. (a) Clearly ‖x‖1 ≥ 0 for all x ∈ X. If ∑n k=1 akek ∈ X is non-zero then am 6= 0 for some m ∈ {1, 2, . . . , n}. This implies that ‖ ∑n k=1 akek‖1 ≥ |am| > 0. Moreover, if ∑n k=1 akek ∈ X and b ∈ K then ∥∥∥∥b n ∑ k=1 akek ∥∥∥∥ 1 = n ∑ k=1 |bak| = |b| ∥∥∥∥ n ∑ k=1 akek ∥∥∥∥ 1 . If ∑n k=1 akek, ∑n k=1 bkek ∈ X then ∥∥∥∥ n ∑ k=1 akek + n ∑ k=1 bkek ∥∥∥∥ 1 = n ∑ k=1 |ak + bk| ≤ n ∑ k=1 |ak|+ n ∑ k=1 |bk| = ∥∥∥∥ n ∑ k=1 akek ∥∥∥∥ 1 + ∥∥∥∥ n ∑ k=1 bkek ∥∥∥∥ 1 . This shows that ‖ · ‖1 is a norm on X. (b) Let (a1, a2, . . . , an) ∈ Kn and suppose that ‖(a1, a2, . . . , an)‖2 = 1. Then ∑n k=1 |ak| = 1, and in particular |ak| ≤ 1 for all k ∈ {1, 2, . . . , n}. It follows that |ak| ≤ 1 for all k ∈ {1, 2, . . . , n}, in which case ∥∥∥∥ n ∑ k=1 akek ∥∥∥∥ 1 = n ∑ k=1 |ak| ≤ n, and hence the linear map (a1, a2, . . . , an) 7→ ∑n k=1 akek is bounded, thus continuous. (c) Define C := {(a1, a2, . . . , an) ∈ Kn | ‖ ∑n k=1 akek‖1 = 1}, so that the image of C under the map from (b) is the given set. Hence, it suffices to show that C is compact. Note that ‖ · ‖1 : X → R is (Lipschitz) continuous, so the map (a1, a2, . . . , an) 7→ ‖ ∑n k=1 akek‖1 from Kn to R is continuous, implying that C (the preimage of {1}) is closed. Moreover C is bounded, thus compact, because for each (a1, a2, . . . , an) ∈ Kn ‖(a1, a2, . . . , an)‖2 ≤ n ∑ k=1 ‖(0, . . . , 0, ak, 0, . . . , 0)‖2 = n ∑ k=1 |ak| = 1. (d) Let ‖ · ‖ : X→ R be a norm on X. If ∑n k=1 akek ∈ X then ∥∥∥∥ n ∑ k=1 akek ∥∥∥∥ ≤ n ∑ k=1 |ak|‖ek‖ ≤ max{‖ek‖}k=1 n ∑ k=1 |ak| = max{‖ek‖}k=1 ∥∥∥∥ n ∑ k=1 akek ∥∥∥∥ 1 . This proves one half of the equivalence and shows that ‖ · ‖ is (Lipschitz) continuous on (X, ‖ · ‖1). It follows that ‖ · ‖ has a minimum at some u ∈ B, where B is the compact set {x ∈ X | ‖x‖1 = 1}. Since 0 / ∈ B, u 6= 0 and hence ‖u‖ > 0. If x ∈ X is non-zero then ‖x‖ = ‖x‖1 ∥∥∥∥ x ‖x‖1 ∥∥∥∥ ≥ ‖x‖1‖u‖, which also holds if x = 0. This proves the other half of the equivalence, so every norm on X is equivalent to ‖ ·‖1. 7. (a) Since X is a Banach space, L(X,X) is also a Banach space. The series ∑∞ k=0(I − T )k is absolutely convergent because ∑∞ k=0 ‖(I − T )k‖ ≤ ∑∞ k=0 ‖I − T‖k, which is a geometric series with ratio ‖I − T‖ < 1. Therefore
منابع مشابه
The Chameleon framework : practical solutions for memory behavior analysis
of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Chapter
متن کاملEquation Chapter 1 Section 1 Analytical Solutions for Radially Functionally Graded Annular Plates
A closed-form solution for deflections and stresses in an annular thin plate of radially functionally graded material under transverse uniform pressure loading is presented. The small displacement theory of elasticity is assumed in the present work. Young’s modulus of the material is taken in the form of a simple power law to vary in the radial direction with an arbitrary exponent showing heter...
متن کاملReal Analysis Chapter 3 Solutions Jonathan Conder
2. Let E be measurable, and suppose that E is ν-null but |ν|(E) 6= 0. Then ν+(E) − ν−(E) = ν(E) = 0 and ν+(E) + ν−(E) = |ν|(E) > 0, so ν+(E) = ν−(E) > 0. Since ν+ ⊥ ν−, there exist disjoint measurable sets A and B covering X such that A is ν+-null and B is ν−-null. In particular ν+(E ∩ B) = ν+(E ∩ B) + ν+(E ∩ A) = ν+(E) > 0 but ν−(E∩B) ≤ ν−(B) = 0. This implies that ν(E∩B) > 0, which is a contr...
متن کاملReal Analysis Chapter 6 Solutions Jonathan Conder
3. Since Lp and Lr are subspaces of CX , their intersection is a vector space. It is clear that ‖ · ‖ is a norm (this follows directly from the fact that ‖ · ‖p and ‖ · ‖r are norms). Let 〈fn〉n=1 be a Cauchy sequence in Lp ∩ Lr. Since ‖fm − fn‖p ≤ ‖fm − fn‖ and ‖fm − fn‖r ≤ ‖fm − fn‖ for all m,n ∈ N, it is clear that 〈fn〉n=1 is a Cauchy sequence in both Lp and Lr. Let gp ∈ Lp and gr ∈ Lr be the...
متن کاملReal Analysis Chapter 8 Solutions Jonathan Conder
3. (a) Note that η(0)(t) = 1 · e−1/t for all t ∈ (0,∞), where 1 is a polynomial of degree 0. Given k ∈ N, suppose that η(k−1)(t) = Pk−1(1/t)e −1/t for all t ∈ (0,∞), where Pk−1(x) is some polynomial of degree 2(k − 1). By the product rule and the chain rule, η(k)(t) = P ′ k−1(1/t)(−t)e + Pk−1(1/t)et = Pk(1/t)e for all t ∈ (0,∞), where Pk(x) := x(Pk−1(x) − P ′ k−1(x)) is a polynomial of degree 2...
متن کاملUsing Real-Time Java in Distributed Systems: Problems
Many real-time systems are distributed, i.e. they use a network to interconnect different Java nodes. The current RTSJ specification is itself insufficient to address this challenge; it requires distributed facilities to control the network and maintain end-to-end real-time performance. To date, the real-time Java community worked in DRTSJ (The Distributed Real-Time Java), the main effort in th...
متن کامل